Automatically weighted binary multi-view clustering via deep initialization (AW-BMVC)
نویسندگان
چکیده
Clustering is inherently a process of exploratory data analysis. It has attracted more attention recently because much real-world consists multiple representations or views. However, it becomes increasingly problematic when dealing with large and heterogeneous data. worth noting that several approaches have been developed to increase computational efficiency, although most them some drawbacks: 1) Most existing techniques consider equal static weights quantify importance across different views samples, so common complementary features cannot be used. 2) The clustering task performed by arbitrary initialization without caring about the rich structure joint discrete representation, thus poorly executed. In this paper, we propose novel approach called ”Auto-Weighted Binary Multi-View Via Deep Initialization” for large-scale multi-view based on two main scenarios. First, distinction between therefore apply dynamic learning strategy automatic weighting samples. Second, in context initializing binary clustering, develop new CNN feature use low-dimensional embedding exploiting efficient capabilities Fourier mapping. Moreover, our simultaneously learns representation performs direct using constrained matrix factorization; optimization problem perfectly solved unified model. Experimental results conducted challenging datasets demonstrate effectiveness superiority proposed over state-of-the-art methods terms accuracy, normalized mutual information, purity.
منابع مشابه
Weighted Multi-view Clustering with Feature Selection
In recent years, combining multiple sources or views of datasets for data clustering has been a popular practice for improving clustering accuracy. As different views are different representations of the same set of instances, we can simultaneously use information from multiple views to improve the clustering results generated by the limited information from a single view. Previous studies main...
متن کاملMulti-objective Multi-view Spectral Clustering via Pareto Optimization
Traditionally, spectral clustering is limited to a single objective: finding the normalized min-cut of a single graph. However, many real-world datasets, such as scientific data (fMRI scans of different individuals), social data (different types of connections between people), web data (multi-type data), are generated from multiple heterogeneous sources. How to optimally combine knowledge from ...
متن کاملPartial Multi-View Clustering
Real data are often with multiple modalities or coming from multiple channels, while multi-view clustering provides a natural formulation for generating clusters from such data. Previous studies assumed that each example appears in all views, or at least there is one view containing all examples. In real tasks, however, it is often the case that every view suffers from the missing of some data ...
متن کاملMulti-view Recognition Using Weighted View Selection
In this paper, we present an algorithm for multi-view recognition in a distributed camera setting that learns which viewpoints are most discriminative for particular instances of ambiguity. Our method is built on top of 2D recognition algorithms and casts view selection as the problem of optimizing kernel weights in multiple kernel learning. The main contribution is a locality-sensitive meta-tr...
متن کاملMulti-View Clustering via Joint Nonnegative Matrix Factorization
Many real-world datasets are comprised of different representations or views which often provide information complementary to each other. To integrate information from multiple views in the unsupervised setting, multiview clustering algorithms have been developed to cluster multiple views simultaneously to derive a solution which uncovers the common latent structure shared by multiple views. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2023
ISSN: ['1873-5142', '0031-3203']
DOI: https://doi.org/10.1016/j.patcog.2022.109281